On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
نویسندگان
چکیده
منابع مشابه
2-restricted Edge Connectivity of Vertex-transitive Graphs
The 2-restricted edge-connectivity λ′′ of a graph G is defined to be the minimum cardinality |S| of a set S of edges such thatG−S is disconnected and is of minimum degree at least two. It is known that λ′′ ≤ g(k − 2) for any connected k-regular graph G of girth g other than K4, K5 and K3,3, where k ≥ 3. In this paper, we prove the following result: For a connected vertex-transitive graph of ord...
متن کاملSuper Cyclically Edge Connected Half Vertex Transitive Graphs
Tian and Meng in [Y. Tian and J. Meng, c -Optimally half vertex transitive graphs with regularity , Information Processing Letters 109 (2009) 683-686] shown that a connected half vertex transitive graph with regularity and girth is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree k k 6 g G ...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملOn transitive orientations with restricted covering graphs
We consider the problem of finding a transitive orientation of a comparability graph, such that the edge set of its covering graph contains a given subset of edges. We propose a solution which employs the classical technique of modular tree decomposition. The method leads to a polynomial time algorithm to construct such an orientation or report that it does not exist. © 2006 Elsevier B.V. All r...
متن کاملPacking k-edge trees in graphs of restricted vertex degrees
Let G r denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk(G) the maximum number of disjoint k-edge trees in G. In this paper we show that (a1) if G ∈ G 2 and s ≥ 4, then τ2(G) ≥ v(G)/(s + 1), (a2) if G ∈ G 2 and G has no 5-vertex components, then τ2(G) ≥ v(G)/4, (a3) if G ∈ G 1 and G has no k-vertex component, where k ≥ 2 and s ≥ 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.08.021